Few buffers suffice: Explaining why and how crossbars with weighted fair queuing converge to weighted max-min fairness
نویسنده
چکیده
We explain why and how a crossbar switch with weighted fair queues (a deterministic device) converges to weighted max-min fair rates of service. Based on a plausible technical hypothesis we prove that a small mean number of buffers suffices to this end. WMMF-rates comprise the unique Nash equilibrium of a natural switching game—a fact that supports further their use.
منابع مشابه
Weighted Fairness in Buffered Crossbar Scheduling
The crossbar is the most popular packet switch architecture. By adding small buffers at the crosspoints, important advantages can be obtained: (1) Crossbar scheduling is simplified. (2) High throughput is achievable. (3) Weighted scheduling becomes feasible. In this paper we study the fairness properties of a buffered crossbar with weighted fair schedulers. We show by means of simulation that, ...
متن کاملPerformance Isolation and Fairness for Multi-Tenant Cloud Storage
Shared storage services enjoy wide adoption in commercial clouds. But most systems today provide weak performance isolation and fairness between tenants, if at all. Misbehaving or high-demand tenants can overload the shared service and disrupt other well-behaved tenants, leading to unpredictable performance and violating SLAs. This paper presents Pisces, a system for achieving datacenter-wide p...
متن کاملVLSI implementation of a fairness ATM buffer system
This paper presents a VESI implementation of a resource allocation scheme, based on the concept of weighted fair queueing. The design can be used in Asynchronous Transfer Mode (ATM) networks to ensure fairness and robustness. Weighted fair queueing is a scheduling and buffer management scheme that can provide a resource allocation policy and enforcement of this policy. It can be used in network...
متن کاملRate Assignment in Micro-Buffered High Speed Networks
Micro-buffered networks are high speed optical packet switched networks, and consist of either nodes with no buffering or nodes with limited buffering. We focus on the case of bufferless nodes, where there is no specific collision resolution mechanisms inside the core. Packet losses inside the core may be frequent, and are dealt with using end-to-end or edgeto-edge coding techniques. In this st...
متن کاملEdge-to-Edge Aggregate Flow Control for the Internet
We present an edge-to-edge flow control scheme which enables an ISP to achieve weighted max-min fair bandwidth allocation among all source-destination pairs on a per-aggregate basis within its network. The motivation behind the scheme is the absence of per-aggregate flow control in the current Internet, resulting in inability to enforce a certain fairness on source-destination flows. The propos...
متن کامل